-
1 снятие ограничений
1) General subject: liberalization, removing constraints2) Law: deregulation3) Economy: lifting of restrictions (lifting of restrictions on foreign ownership of Gazprom shares)4) Accounting: ease5) Business: derestrictionУниверсальный русско-английский словарь > снятие ограничений
-
2 аппаратное ограничение
1. hardware constraintязык ограничений; декларативный язык — constraint language
матрица условий; матрица ограничений — constraint matrix
2. hardware restrictionРусско-английский большой базовый словарь > аппаратное ограничение
См. также в других словарях:
Poverty — Street children sleeping in Mulberry Street – Jacob Riis photo New York, United States (1890) Poverty is the state of one who lacks a certain amount of material possessions or money.[1] Absolute poverty or destitution is inability to afford … Wikipedia
Viable System Model — The Viable Systems Model, or VSM is a model of the organisational structure of any viable or autonomous system. A viable system is any system organised in such a way as to meet the demands of surviving in the changing environment. One of the… … Wikipedia
Mariann Fischer Boel — European Commissioner for Agriculture and Rural Development In office 22 November 2004 – 9 February 2010 President José Manuel Barroso Preceded by Franz Fischler Sandra Kalniete (Agriculture, Rural Develop … Wikipedia
deregulation — noun The process of removing constraints, especially government imposed economic regulation. The airline industry has not been profitable since Ronald Reagan began deregulation … Wiktionary
Local consistency — In constraint satisfaction, local consistency conditions are properties of constraint satisfaction problems related to the consistency of subsets of variables or constraints. Several such conditions exist, the most known being node consistency,… … Wikipedia
Decomposition method (constraint satisfaction) — In constraint satisfaction, a decomposition method translates a constraint satisfaction problem into another constraint satisfaction problem that is binary and acyclic. Decomposition methods work by grouping variables into sets, and solving a… … Wikipedia
Constraint logic programming — Programming paradigms Agent oriented Automata based Component based Flow based Pipelined Concatenative Concurrent computing … Wikipedia
Constraint satisfaction dual problem — The dual problem is a reformulation of a constraint satisfaction problem expressing each constraint of the original problem as a variable. Dual problems only contain binary constraints, and are therefore solvable by algorithms tailored for such… … Wikipedia
Dynkin diagram — See also: Coxeter–Dynkin diagram Finite Dynkin diagrams Affine (extended) Dynkin diagrams … Wikipedia
Data Validation and Reconciliation — Industrial process data validation and reconciliation or short data validation and reconciliation (DVR) is a technology which is using process information and mathematical methods in order to automatically correct measurements in industrial… … Wikipedia
international relations — a branch of political science dealing with the relations between nations. [1970 75] * * * Study of the relations of states with each other and with international organizations and certain subnational entities (e.g., bureaucracies and political… … Universalium